Multi-probe consistent hashing
نویسندگان
چکیده
1 Abstract We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + ε with just 1 + 1 ε lookups per key.
منابع مشابه
Multi-Level Spherical Locality Sensitive Hashing For Approximate Near Neighbors
This paper introduces “Multi-Level Spherical LSH”: parameter-free, a multi-level, data-dependant Locality Sensitive Hashing data structure for solving the Approximate Near Neighbors Problem (ANN). This data structure is a modified version multi-probe adaptive querying algorithm, with the potential of achieving a O(np + t) query run time, for all inputs n where t <= n. Keywords—Locality Sensitiv...
متن کاملIntelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond
The past decade has been marked by the (continued) explosion of diverse data content and the fast development of intelligent data analytics techniques. One problem we identified in the mid-2000s was similarity search of feature-rich data. The challenge here was achieving both high accuracy and high efficiency in high-dimensional spaces. Locality sensitive hashing (LSH), which uses certain rando...
متن کاملMulti-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search
Similarity indices for high-dimensional data are very desirable for building content-based search systems for featurerich data such as audio, images, videos, and other sensor data. Recently, locality sensitive hashing (LSH) and its variations have been proposed as indexing techniques for approximate similarity search. A significant drawback of these approaches is the requirement for a large num...
متن کاملHierarchical Hashing for Pattern Search in 3D Vector Fields Additional Material
Abstract In this material, we present an analysis of different LSH strategies and parameters. Firstly, We evaluate the accuracy of hashing retrieval under different number of hashing functions. Secondly, we compare the classic LSH algorithm [IM98] and multi-probe LSH algorithm [LJW∗07] based on their accuracy of retrieval. Our selections of strategy and parameters are all based on these evaluat...
متن کاملRobust and Efficient Locality Sensitive Hashing for Nearest Neighbor Search in Large Data Sets
Locality sensitive hashing (LSH) has been used extensively as a basis for many data retrieval applications. However, previous approaches, such as random projection and multi-probe hashing, may exhibit high query complexity of up to Θ(n) when the underlying data distribution is highly skewed. This is due to the imbalance in the number of data stored per each bucket, which leads to slow query tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1505.00062 شماره
صفحات -
تاریخ انتشار 2015